An Estimation of Distribution Algorithm Utilizing Opposition-Based Learning for Nonlinear Blind Sources Separation

نویسندگان

  • Ying Gao
  • Waixi Li
چکیده

An estimation of distribution algorithm utilizing opposition-based learning is firstly proposed in this paper. In the proposed algorithm, opposite population is generated from the current population by calculating opposite numbers, and the best individuals in the population with the current population and the opposite population are selected to form the next population based on fitness values. Then, demixing system of the blind sources separation with post-nonlinear mixture is modeled using a multi-input multi-output wavelet neural network whose parameters can be determined under the criterion of independence of its outputs. A criterion of independence based on higher order moments is used to measure the statistical dependence of the outputs of the demixing system, and the proposed algorithm is utilized to minimize the criterion. Finally, the proposed algorithm is compared with the version of the original estimation of distribution algorithm on some well-known benchmarks, and used to a post-nonlinear blind sources separation problem with two independent random signals. The relative experimental results demonstrate that the algorithm outperforms the original estimation of distribution algorithm, and is effective for post-nonlinear blind source separation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Signal Separation Using an Extended Infomax Algorithm

The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...

متن کامل

Blind Source Separation Using Maximum Entropy Pdf Estimation Based on Fractional Moments

Recovering a set of independent sources which are linearly mixed is the main task of the blind source separation. Utilizing different methods such as infomax principle, mutual information and maximum likelihood leads to simple iterative procedures such as natural gradient algorithms. These algorithms depend on a nonlinear function (known as score or activation function) of source distributions....

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017